SPICE: Scalable P2P implicit group messaging
نویسندگان
چکیده
Implicit group messaging (IGM) is a decoupled messaging paradigm for connecting content publishers and consumers over the Internet. Unlike traditional multicast or publish/subscribe messaging, IGM delivers content to ‘‘implicit groups’’ of consumers with characteristics specified by the publisher at the time of publication. IGM systems must support thousands of users and an infinite number of implicit groups formed on demand as messages are published. These groups may be messaged repeatedly or once only, with group sizes scaling from no members to the entire network. Load distribution is a key problem of such systems. This paper broadens our earlier work [D. Cutting, B. Landfeldt, A. Quigley, Implicit group messaging over peer-to-peer networks, in: A. Montresor, A. Wierzbicki, N. Shahmehri (Eds.), Sixth IEEE International Conference on Peer-to-Peer Computing (P2P2006), IEEE Computer Society, Cambridge, United Kingdom, September 2006, pp. 125–132.] in three ways: we provide a formal specification of implicit groups and implicit group messaging; we introduce a comprehensive framework for analysing the efficiency and fairness of generic IGM implementations; and our distributed structured peer-to-peer IGM model, SPICE, is augmented with adaptive load distribution techniques. Through detailed simulation and analysis using Zipfian data sources we demonstrate these techniques are capable of very fairly distributing incoming and outgoing loads over peers irrespective of the scale of implicit groups or frequency of messages. ! 2007 Elsevier B.V. All rights reserved.
منابع مشابه
Special Interest Messaging: A Comparison of IGM Approaches
Hundreds of technical, special interest Internet weblogs are already generating thousands of niche articles worldwide, and many institutions are starting to create internal blogs for team collaboration. As this style of communication becomes more pervasive in the lives of employees and researchers, the difficulty of finding relevant information only grows with the number of authors and articles...
متن کاملP2P Network Trust Management Survey
Peer-to-peer applications (P2P) are no longer limited to home users, and start being accepted in academic and corporate environments. While file sharing and instant messaging applications are the most traditional examples, they are no longer the only ones benefiting from the potential advantages of P2P networks. For example, network file storage, data transmission, distributed computing, and co...
متن کاملA High Performance Messaging System for Peer-to-peer Networks
Emerging peer-to-peer concepts provide new possibilities but also challenges for distributed applications. Despite their significant potential, current peer-to-peer networks lack efficient group communication. This thesis addresses this deficiency and proposes the P2P Messaging System, which collaborates with peer-to-peer networks. For each peer group, it establishes virtual overlay networks ba...
متن کاملGGRA: a grouped gossip-based reputation aggregation algorithm
An important issue in P2P networks is the existence of malicious nodes that decreases the performance of such networks. Reputation system in which nodes are ranked based on their behavior, is one of the proposed solutions to detect and isolate malicious (low ranked) nodes. Gossip Trust is an interesting previously proposed algorithm for reputation aggregation in P2P networks based on t...
متن کاملPOST: A Secure, Resilient, Cooperative Messaging System
POST is a decentralized messaging infrastructure that supports a wide range of collaborative applications, including electronic mail, instant messaging, chat, news, shared calendars and whiteboards. POST is highly resilient, secure, scalable and does not rely on dedicated servers. Instead, POST is built upon a peer-to-peer (p2p) overlay network, consisting of participants’ desktop computers. PO...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computer Communications
دوره 31 شماره
صفحات -
تاریخ انتشار 2008